A complete characterization of primitive recursive intensional behaviours
نویسنده
چکیده
We give a complete characterization of the class of functions that are the intensional behaviours of Primitive Recursive algorithms. This class is the set of primitive recursive functions that have a null basic case of recursion. This result is obtained using the property of ultimate unarity and a geometrical approach of sequential functions on N the set of positive integers. AMS Subject Classification. — Give AMS classification codes —.
منابع مشابه
A Class of Reversible Primitive Recursive Functions
Reversible computing is bi-deterministic which means that its execution is both forward and backward deterministic, i.e. next/previous computational step is uniquely determined. Various approaches exist to catch its extensional or intensional aspects and properties. We present a class RPRF of reversible functions which holds at bay intensional aspects and emphasizes the extensional side of the ...
متن کاملTermination Analysis of the Untyped λ-Calculus
An algorithm is developed that, given an untyped λ-expression, can certify that its call-by-value evaluation will terminate. It works by an extension of the “size-change principle” earlier applied to firstorder programs. The algorithm is sound (and proven so in this paper) but not complete: some λ-expressions may in fact terminate under callby-value evaluation, but not be recognised as terminat...
متن کاملIntensional Investigations
This thesis is about the theory and practice of intensional semantics. Traditional denotational models of programming languages are usually extensional in that they concern themselves only with input/output properties of programs. The meaning of a program is typically taken to be a function from input to output containing no information about the way that function computes its result. In an int...
متن کاملThe Decidable Properties of Subrecursive Functions
What can be decided or semidecided about a primitive recursive function, given a definition of that function by primitive recursion? What about subrecursive classes other than primitive recursive functions? We provide a complete and explicit characterization of the decidable and semidecidable properties. This characterization uses a variant of Kolmogorov complexity where only programs in a subr...
متن کاملA semantics for functions and behaviours
The functional animation language Fran allows animations to be programmed in a novel way. Fran provides an abstract datatype of \behaviours" that represent time varying values such as the position of moving objects, together with a simple set of operators for constructing behaviours. More generally, this approach has potential for other kinds of real-time systems that consist of interactive com...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- ITA
دوره 42 شماره
صفحات -
تاریخ انتشار 2008